Dirac's Condition for Spanning Halin Subgraphs
نویسندگان
چکیده
منابع مشابه
Spanning subgraphs with specified valencies
The author has published a necessary and sufficient condition for a fmite loopless graph to have a spanning subgraph with a specified positive valency at each vertex (see [8,9). In the present paper it is contended that the condition can be made more useful as a tool of graph theory by imposing a maximality condition. 1. The condition for an I-factor Let G be a finite graph. Loops and multiple ...
متن کاملReconfiguring spanning and induced subgraphs
Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure property. Although there has been previous work that can be categorized as subgraph reconfiguration, most of the related results appear under the name of the...
متن کاملPlane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs
A Halin graph is a simple plane graph consisting of a tree without degree 2 vertices and a cycle induced by the leaves of the tree. In 1975, Lovász and Plummer conjectured that every 4-connected plane triangulation has a spanning Halin subgraph. In this paper, we construct an infinite family of counterexamples to the conjecture.
متن کاملGenerating k-Vertex Connected Spanning Subgraphs and k-Edge Connected Spanning Subgraphs
We show that k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k. We also show that generating k-edge connected spanning subgraphs, where k is part of the input, can be done in incremental polynomial time. These results are based on properties of minimally k-connected graphs which might be of independent interest.
متن کاملPlane Triangulations Without a Spanning Halin Subgraph II
A Halin graph is a plane graph constructed from a planar drawing of a tree by connecting all leaves of the tree with a cycle which passes around the boundary of the graph. The tree must have four or more vertices and no vertices of degree two. Halin graphs have many nice properties such as being Hamiltonian and remain Hamiltonian after any single vertex deletion. In 1975, Lovász and Plummer con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2019
ISSN: 0895-4801,1095-7146
DOI: 10.1137/17m1138960